Pcmi Lecture Notes on Property (t ), Expander Graphs and Approximate Groups (preliminary Version)
نویسنده
چکیده
The final aim of these lectures will be to prove spectral gaps for finite groups and to turn certain Cayley graphs into expander graphs. However in order to do so it is useful to have some understanding of the analogous spectral notions of amenability and Kazhdan property (T ) which are important for infinite groups. In fact one important aspect of asymptotic group theory (the part of group theory concerned with studying the geometric and group theoretic properties of large finite groups) is the ability to pass from the world of infinite groups to the that of finite groups and vice-versa and to manage to transfer results from one world to the other.
منابع مشابه
Lecture 4: Approximate Groups and the Bourgain-gamburd Method (preliminary Version)
Up until the Bourgain-Gamburd 2005 breakthrough the only known ways to turn SLd(Fp) into an expander graph (i.e. to find a generating set of small size whose associated Cayley graph has a good spectral gap) was either through property (T ) (as in the Margulis construction) when d > 3 or through the Selberg property (and the dictionary between combinatorial expansion of the Cayley graphs and the...
متن کاملLecture 6 : Random Walks versus Independent Sampling
For many problems it is necessary to draw samples from some distribution D on a typically large set V . In order to do so, one often considers a Markov chain on V whose limiting distribution is D. The efficiency of the sampling algorithm requires the Markov chain to converge quickly. Two famous examples where this approach have been applied successfully are approximation algorithms for the perm...
متن کاملNotes 3 : Expander graphs – a ubiquitous pseudorandom structure
In this lecture, we will focus on expander graphs (also called expanders), which are pseudoran-dom objects in a more restricted sense than what we saw in the last two lectures. The reader is also referred to the monograph [1] and the tutorial slides [2] for more detailed surveys of today's topics. Expander graphs are universally useful in computer science and have many applications in de-random...
متن کاملSymmetric Groups and Expanders
We construct an explicit generating sets Fn and F̃n of the alternating and the symmetric groups, which make the Cayley graphs C(Alt(n), Fn) and C(Sym(n), F̃n) a family of bounded degree expanders for all sufficiently large n. These expanders have many applications in the theory of random walks on groups and other areas of mathematics. A finite graph Γ is called an ǫ-expander for some ǫ ∈ (0, 1), ...
متن کاملProperty (T) and all that
In these talks I’ll try to explain these classes of groups so peculiarly separated by chance. I’ll start in § 1 with amenable groups, which have been studied the longest (since von Neumann in the 1920s, who was investigating the Banach–Tarski paradox as Henry explained last term), and are a very natural class of groups to look at. Then I’ll move on in § 2 to an enormous superset of the amenable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012